CUBE PACKINGS IN EUCLIDEAN SPACES

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatial Analysis in curved spaces with Non-Euclidean Geometry

The ultimate goal of spatial information, both as part of technology and as science, is to answer questions and issues related to space, place, and location. Therefore, geometry is widely used for description, storage, and analysis. Undoubtedly, one of the most essential features of spatial information is geometric features, and one of the most obvious types of analysis is the geometric type an...

متن کامل

Cube packings, second moment and holes

We consider tilings and packings of R by integral translates of cubes [0, 2[, which are 4Z-periodic. Such cube packings can be described by cliques of an associated graph, which allow us to classify them in dimension d ≤ 4. For higher dimension, we use random methods for generating some examples. Such a cube packing is called non-extendible if we cannot insert a cube in the complement of the pa...

متن کامل

Packings in real projective spaces

This paper applies techniques from algebraic and differential geometry to determine how to best pack points in real projective spaces. We present a computer-assisted proof of the optimality of a particular 6-packing in RP, we introduce a linear-time constant-factor approximation algorithm for packing in the so-called Gerzon range, and we provide local optimality certificates for two infinite fa...

متن کامل

Circle Packings of Maps - the Euclidean Case

In an earlier work, the author extended the AndreevKoebe-Thurston circle packing theorem. Additionally, a polynomial time algorithm for constructing primal-dual circle packings of arbitrary (essentially) 3-connected maps was found. In this note, additional details concerning surfaces of constant curvature 0 (with special emphasis on planar graphs where a slightly different treatment is necessar...

متن کامل

Dense Packings of Equal Spheres in a Cube

We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this stochastic algorithm, we introduce systematic perturbations in it. We apply this perturbed billiard algorithm in the case of n spheres in a cube and display all the optimal and best known packings up to n = 32. We imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematika

سال: 2021

ISSN: 0025-5793,2041-7942

DOI: 10.1112/mtk.12074